Timing-dependent boundedness and liveness in continuous Petri nets

The very classical structural boundedness and repetitiveness properties for discrete and untimed models are reconsidered for timed continuous Petri nets (TCPN), under infinite server semantics. The timing is here involved in the analysis, by taking advantage of its matricial characterization and properties analogous to conservativeness and consistency are defined. It is shown that such properties are sufficient for timed boundedness and timed liveness, respectively, even if the untimed model does not exhibit them. The rest of the paper is devoted to study these timing-dependent boundedness and liveness.